Linear bilevel programming with upper level constraints depending on the lower level solution
نویسندگان
چکیده
منابع مشابه
Linear bilevel programming with upper level constraints depending on the lower level solution
Focus in the paper is on the definition of linear bilevel programming problems, the existence of optimal solutions and necessary as well as sufficient optimality conditions. In the papers [9] and [10] the authors claim to suggest a refined definition of linear bilevel programming problems and related optimality conditions. Mainly their attempt reduces to shifting upper level constraints involvi...
متن کاملA New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کاملBilevel Optimization with Nonsmooth Lower Level Problems
We consider a bilevel optimization approach for parameter learning in nonsmooth variational models. Existing approaches solve this problem by applying implicit differentiation to a sufficiently smooth approximation of the nondifferentiable lower level problem. We propose an alternative method based on differentiating the iterations of a nonlinear primal–dual algorithm. Our method computes exact...
متن کاملBILEVEL LINEAR PROGRAMMING WITH FUZZY PARAMETERS
Bilevel linear programming is a decision making problem with a two-level decentralized organization. The textquotedblleft leadertextquotedblright~ is in the upper level and the textquotedblleft followertextquotedblright, in the lower. Making a decision at one level affects that at the other one. In this paper, bilevel linear programming with inexact parameters has been studied and a method is...
متن کاملTwo-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints
This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints. Firstly, we consider some lower level constraint qualifications (CQs) for this problem. Then, under these CQs, we derive formula for estimating the subdifferential of its valued function. Finally, we present some necessary optimality condit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2006
ISSN: 0096-3003
DOI: 10.1016/j.amc.2005.11.134